Another Simple but Faster Method for 2D Line Clipping
نویسندگان
چکیده
منابع مشابه
Algorithms for 2D Line Clipping
New algorithms for 2D line clipping against convex, non-convex windows and windows that consist of l inear edges and arcs are being presented. Algorithms were derived from the Cohen-Sutherland 's and Liang-Barsky s algorithms. The general algorithm with linear edges and arcs can be used especially for engineering drafting systems. Algorithms are easy to modify in order to deal with holes too. T...
متن کاملA simple, faster method for kinetic proximity problems
For a set of n points in the plane, this paper presents simple kinetic data structures (KDS’s) for solutions to some fundamental proximity problems, namely, the all nearest neighbors problem, the closest pair problem, and the Euclidean minimum spanning tree (EMST) problem. Also, the paper introduces KDS’s for maintenance of two well-studied sparse proximity graphs, the Yao graph and the Semi-Ya...
متن کاملA simple en, ex marking rule for degenerate intersection points in 2D polygon clipping
A simple en,ex rule to mark the intersection points of 2D input polygon contours separating the polygon interior from its exterior in the vicinity of the intersections is presented. Its form is close to the original Greiner & Hormann algorithm rule but encompasses degenerate intersections that are not self-intersections. It only uses local geometric information once the orientation of the two i...
متن کاملCoML: Yet Another, But Simple Component Composition Language
Components offer various advantages, such as platform and tool independence but composition languages do not address the same independence. We present a platform independent component composition language called Component Markup Language. CoML offers abstractions for component composition and for meta information. We envision different usage scenarios for CoML as a resource script or input for ...
متن کاملA Simple and Efficient Algorithm for Line and Polygon Clipping in 2-D Computer Graphics
The most popular lines clipping algorithms are Cohen-Sutherland and Liang-Barsky line clipping algorithm. These algorithms are complex and the steps of calculation are very high. This paper proposes a simple new line clipping algorithm for 2D space which uses the parametric equation of the line. This algorithm further easily extended to the polygon clipping by considering the edge of the polygo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Graphics & Animation
سال: 2019
ISSN: 2231-3591,2231-3281
DOI: 10.5121/ijcga.2019.9301